Cooperative vehicle navigation

ABSTRACT

A computer is programmed to determine a trajectory of a first vehicle. The computer is programmed to determine whether a second vehicle blocks the trajectory. Upon such determination, the computer sends an instruction to the second vehicle to adjust the second vehicle speed. The computer is programmed to determine the instruction based on the determined trajectory of the first vehicle, a second vehicle location, and a second vehicle speed.

BACKGROUND

When a vehicle changes its driving lane, there is often a risk of acollision with an object, e.g., another vehicle. A driver of the vehiclemay initiate a lane change without recognizing or attempting to mitigatea collision risk, e.g., where another vehicle is in a blind spot of thedriver. In another example, a plurality of lane changes may benecessary, e.g., when a vehicle intends to leave a multi lane highway,which may increase a risk of collision compared to a single lane change.Heavy traffic, e.g., when a plurality of lane changes is necessary, mayeven lead to deviating from an intended route, e.g., missing a highwayexit.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram illustrating an example vehicle system.

FIG. 2A is a diagram showing an example of a plurality of vehiclesdriving in a plurality of lanes.

FIG. 2B-2D are diagrams showing various lane change scenarios for avehicle of FIG. 2A.

FIG. 3 is an example graph showing a change of a vehicle speed overtime.

FIGS. 4A-4C are a flowchart of an exemplary process for host vehiclesending instructions to other vehicle for unblocking a path.

FIG. 5 is a flowchart of an exemplary process for a client vehiclereceiving instructions from a host vehicle.

DETAILED DESCRIPTION Introduction

Disclosed herein is a vehicle 100 computer 110 that is programmed todetermine a trajectory 230 of a first vehicle 100, e.g., to change froma lane 210 a to a lane 210 c. The computer 110 is programed to determinewhether a second vehicle 101 blocks the determined trajectory 230 of thefirst vehicle 100. Upon such determination, the computer 110 sends aninstruction to the second vehicle 101 to adjust the second vehicle 101speed. The computer 110 is programmed to determine the instruction basedon the determined trajectory 230 of the first vehicle 100, a secondvehicle 101 location, and a second vehicle 101 speed.

The computer 110 may be programmed send the instruction where theinstruction is further based on a first vehicle 100 speed and a firstvehicle 100 location.

The computer 110 may be further programmed to determine the secondvehicle 101 speed and the second vehicle 101 location based on datareceived from first vehicle 100 sensors.

The computer 110 may be programmed to determine the trajectory 230 ofthe first vehicle 100 wherein the determined trajectory 230 includes alateral lane 210 change.

The computer 110 may be programmed to determine the trajectory 230wherein the determined trajectory 230 of the first vehicle 100 includesa curvature intersecting at least one road 250 lane 210 marking 220.

The computer 110 may be programmed to determine the trajectory 230 basedon a predetermined route.

The computer 110 may be programmed to determine the trajectory 230 basedon activation of a first vehicle 100 turn signal.

The computer 110 may be programmed to, upon receiving a refusal from thesecond vehicle 101 to modify its speed, determine a second trajectory230 of the first vehicle 100. The computer 110 may be programmed toidentify a third vehicle 101 that blocks the second trajectory 230, andsend, to the third vehicle 101, a second instruction to adjust a thirdvehicle 101 speed based on the second trajectory 230, a second vehicle101 location, and a second vehicle 101 speed.

The computer 110 may be programmed to send a plurality of instructionsto a plurality of second vehicles 101, wherein each of the instructionsis associated with one of the plurality of second vehicles 101 and isbased at least on a speed and a location of the respective secondvehicle 101.

As disclosed herein is a method comprising determining a trajectory 230of a first vehicle 100 movement. The method may further include, upondetermining that a second vehicle 101 blocks the determined trajectory230, sending, to the second vehicle 101, an instruction to adjust asecond vehicle 101 speed, based on the determined trajectory 230 of thefirst vehicle 100, a second vehicle 101 location, and a second vehicle101 speed. The method may further include receiving, in the secondvehicle 101, the instruction to adjust the second vehicle 101 speed to atarget speed, and applying the received instruction by actuating secondvehicle 101 operations at least in part based on the receivedinstruction.

The method may comprise determining a trajectory 230 of a first vehicle100, and upon determining that a second vehicle 101 blocks thedetermined trajectory 230, sending, to the second vehicle 101, aninstruction, based on the determined trajectory 230 of the first vehicle100, a second vehicle 101 location, and a second vehicle 101 speed, toadjust the second vehicle 101 speed.

The method may further comprise sending the instruction that is based ona first vehicle 100 speed and a first vehicle 100 location.

The method may further comprise determining the second vehicle 101 speedand the second vehicle 101 location based on data received from firstvehicle 100 sensors.

The method may comprise determining the trajectory 230 of the firstvehicle 100 wherein the determined trajectory 230 of the first vehicle100 includes a lateral lane change.

The method may comprise determining the trajectory 230 of the firstvehicle 100 wherein the determined trajectory 230 of the first vehicle100 includes a curvature intersecting at least one road 250 lane marking220.

The method may further comprise determining the trajectory 230 based ona predetermined route.

The method may further comprise determining the trajectory 230 based onactivation of a first vehicle 100 turn signal.

The method may further comprise, upon receiving a refusal from thesecond vehicle 101 to modify its speed, determining a second trajectory230 of the first vehicle 100, identifying a third vehicle 101 thatblocks the second trajectory 230, and sending, to the third vehicle 101,a second instruction to adjust a third vehicle 101 speed based on thesecond trajectory 230, a second vehicle 101 location, and a secondvehicle 101 speed.

The method may further comprising sending a plurality of instructions toa plurality of second vehicles 101, wherein each of the instructions isassociated with one of the second vehicles 101 and is based at least ona speed and a location of the respective second vehicle 101.

The method may further comprise receiving, in the second vehicle 101,the instruction from the first vehicle 100, determining, in the secondvehicle 101, whether to accept the received instruction based on atleast on one of a second vehicle 101 target speed and atime-to-collision of the first vehicle 100. The method may furthercomprise, upon determining that the received instruction is acceptable,actuating a second vehicle 101 actuator based on the receivedinstruction.

For convenience herein, the vehicle 100 may be referred to as a first orhost vehicle 100, and the second vehicle 101 may be referred to as asecond or client vehicle 101. FIG. 1 illustrates elements included inthe host vehicle 100. However, a host vehicle 100 and a client vehicle101 may have like elements, and to avoid repetition a separate blockdiagram of the vehicle 101 is not provided but it is to be understoodthat the elements shown in FIG. 1 may also be included in a vehicle 101,including a computer 110, actuators 120, sensors 130, a human machineinterface (HMI) 140, and/or a wireless communication interface 160 eachof which are discussed in more detail below.

Exemplary System Elements

FIG. 1 illustrates a vehicle 100. The vehicle 100 may be powered in avariety of ways, e.g., with an electric motor and/or internal combustionengine. The vehicle 100, 101 is a land vehicle such as a car, truck,etc. Additionally or alternatively, the vehicle 100, 101 may include abike, e.g., a motorcycle. A vehicle 100, 101 may include a computer 110,actuator(s) 120, sensor(s) 130, an HMI 140, and a wireless communicationinterface 160. A vehicle 100, 101 has a geometrical center point 150,e.g., points at which respective longitudinal and lateral center linesof the vehicle 100 intersect.

The computer 110 includes a processor and a memory such as are known.The memory includes one or more forms of computer-readable media, andstores instructions executable by the computer 110 for performingvarious operations, including as disclosed herein.

The computer 110 may operate the respective vehicle 100 in anautonomous, a semi-autonomous mode, or a non-autonomous (or manual)mode. For purposes of this disclosure, an autonomous mode is defined asone in which each of vehicle 100 propulsion, braking, and steering arecontrolled by the computer 110; in a semi-autonomous mode the computer110 controls one or two of vehicles 100 propulsion, braking, andsteering; in a non-autonomous mode a human operator controls each ofvehicle 100 propulsion, braking, and steering.

The computer 110 may include programming to operate one or more of landvehicle brakes, propulsion (e.g., control of acceleration in the vehicleby controlling one or more of an internal combustion engine, electricmotor, hybrid engine, etc.), steering, climate control, interior and/orexterior lights, etc., as well as to determine whether and when thecomputer 110, as opposed to a human operator, is to control suchoperations. Additionally, the computer 110 may be programmed todetermine whether and when a human operator is to control suchoperations.

The computer 110 may include or be communicatively coupled to, e.g., viaa vehicle 100 communications bus as described further below, more thanone processor, e.g., controllers or the like included in the vehicle formonitoring and/or controlling various vehicle controllers, e.g., apowertrain controller, a brake controller, a steering controller, etc.The computer 110 is generally arranged for communications on a vehiclecommunication network that can include a bus in the vehicle such as acontroller area network (CAN) or the like, and/or other wired and/orwireless mechanisms.

Via the vehicle 100 network, the computer 110 may transmit messages tovarious devices in the vehicle and/or receive messages from the variousdevices, e.g., an actuator 120, an HMI 140, etc. Alternatively oradditionally, in cases where the computer 110 actually comprises aplurality of devices, the vehicle 100 communication network may be usedfor communications between devices represented as the computer 110 inthis disclosure. Further, as mentioned below, various controllers and/orsensors may provide data to the computer 110 via the vehiclecommunication network.

In addition, the computer 110 may be configured for communicatingthrough a vehicle-to-vehicle (V-to-V) wireless communication interface160 with other vehicles 101, e.g., via a vehicle-to-vehiclecommunication network. The V-to-V communication network represents oneor more mechanisms by which the computers 110 of vehicles 100 maycommunicate with other vehicles 101, and may be one or more of wirelesscommunication mechanisms, including any desired combination of wireless(e.g., cellular, wireless, satellite, microwave and radio frequency)communication mechanisms and any desired network topology (or topologieswhen a plurality of communication mechanisms are utilized). ExemplaryV-to-V communication networks include cellular, Bluetooth, IEEE 802.11,dedicated short range communications (DSRC), and/or wide area networks(WAN), including the Internet, providing data communication services.

The vehicle 100 actuators 120 are implemented via circuits, chips, orother electronic and or mechanical components that can actuate variousvehicle subsystems in accordance with appropriate control signals as isknown. The actuators 120 may be used to control braking, acceleration,and steering of the vehicles 100. For example, in a semi-autonomousmode, the computer 110 may actuate a steering actuator 120 to change avehicle lane upon receiving a user request from a human operator tochange the lane (see FIG. 2).

The sensors 130 may include a variety of devices known to provide datato the computer 110. For example, the sensors 130 may include LightDetection And Ranging (LIDAR) sensor(s) 130 disposed on a top of thevehicle 100 that provide relative locations, sizes, and shapes of thesecond vehicles 101 surrounding the vehicle 100, including the secondvehicles 101 travelling next to or behind the vehicle 100 (see FIGS.2A-2C). As another example, one or more radar sensors 130 fixed tovehicle 100 bumpers may provide locations of the second vehicles 101travelling in front, side, and/or rear of the vehicle 100, relative tothe location of the vehicle 100. The sensors 130 may furtheralternatively or additionally include camera sensor(s) 130, e.g. frontview, side view, etc., providing images from an area surrounding thevehicle 100. For example, the computer 110 may be programmed to receiveimage data from the camera sensor(s) 130 and to implement imageprocessing techniques to detect lane markings 220, lane(s) 210 a, 210 b,210 c, and other objects such as vehicles 101.

The computer 110 may be further programmed to determine a currentdriving lane 210 a of the vehicle 100, e.g., based on global positioningsystem (GPS) coordinates and/or detected lane markings 220. Based ondata received from the sensors 130, the computer 110 may determine arelative distance, speed, etc. of other vehicles 101 relative to thevehicle 100. As another example, the computer 110 may be programmed toreceive data including relative speed, location coordinates, and/ordirection of other vehicles 101 via the wireless communication network.For example, the computer 110 may receive such data from GPS sensorsdisposed in other vehicles 101 that provides geographical coordinates,movement direction, speed, etc., of the second vehicles 101.

The HMI 140 may be configured to receive input from a human operatorduring operation of the vehicle 100. Moreover, an HMI 140 may beconfigured to display, e.g., via visual and/or audio output, informationto the user. Thus, an HMI 140 may be located in the passengercompartment of the vehicle 100 and may include one or more mechanismsfor user input. For example, the HMI 140 may include a turn signalswitch. In an example non-autonomous mode, the computer 110 may receivea request to change the lane 210, e.g., a turn left signal to indicatean intention of vehicle 100 user to change from a current lane 210 a toa target lane 210 b.

In an example semi-autonomous mode, the computer 110 may be programmedto perform the lane change upon receiving an entry from the user, e.g.,via the turn signal switch, touch screen, etc. In other words, thecomputer 110 may be programmed to execute a lane change but only if avehicle 100 user confirms a change of the current lane 210 a.

The computer 110 may be programmed to receive a destination, e.g.,location coordinates, via the HMI 140, and determine a route from acurrent location of the vehicle 100 to the received destination. Thecomputer 110 may be programmed to operate the vehicle 100 in anautonomous mode from the current location to the received destinationbased on the determined route.

For example, the computer 110 may be programmed to determine that a lanechange is needed to exit a freeway to follow the determined route. Inanother example, the vehicle 100 user may cause a lane change while thevehicle is operated in a non-autonomous mode, based on data outputted onthe vehicle 100 HMI 140, e.g., a visual and/or audio request to turnright or left. In another example, the computer 110 may be programmed todetermine that a lane change is needed to prevent a collision of thehost vehicle 100 with an obstacle on the host vehicle 100 current lane210. For example, the computer 110 may be programmed to determine that alane change needed upon determining that a time-to-collision with anobstacle on the current lane 210 of the host vehicle 100 is less than atime to stop the vehicle 100 by braking. In this example, the computer110 could be programed to determine the time-to-collision based on aspeed and acceleration of the host vehicle 100, and a distance betweenthe host vehicle 100 and the obstacle. The computer 110 may beprogrammed to determine a time-to-stop the host vehicle 100 based on thespeed and acceleration of host vehicle 100, and a predetermined maximumdeceleration provided by the vehicle 100 braking actuator 120.

With reference to FIG. 2A-2C, the vehicle 100 computer 110 may beprogrammed to determine, e.g., a trajectory 230, of the first vehicle100. Upon determining that, e.g., a second vehicle 101 a, blocks thedetermined trajectory 230, the computer 110 may send an instruction tothe second vehicle 101 a to adjust its speed. The computer 110 may beprogrammed to determine the instruction based on the determinedtrajectory 230 of the first vehicle 100, a second vehicle 101 alocation, and/or a second vehicle 101 a speed.

A trajectory, e.g., a trajectory 230, 230 a, 230 b, 240, 240 a, 240 b,240 c, in the context of present disclosure refers to an expected orprojected movement path of a vehicle 100, 101 starting from a currentlocation of the vehicle 100, 101 and extending for at least apredetermined distance, e.g., 100 meters, ahead of the vehicle 100, 101.The computer 110 may be programmed to actuate vehicle 100, 101 actuators120 to navigate the vehicle 100, 101 on the trajectory, e.g., byaccelerating, braking, steering. The respective trajectories 230, 240 ofvehicles 100, 101 may include curves and/or straight lines on a groundsurface, e.g., a road 250.

As another example, a trajectory 240 a of a vehicle 101 a that moves ina lane 210 b may follow a curvature of a lane 210 b. A movement of avehicle 100, 101 on a trajectory may include a longitudinal and alateral movement. A longitudinal movement may refer to a movementparallel to a straight edge of a lane 210, or parallel to a tangent to aclosest point of the lane 210 edge where the edge is curved. A lateralmovement is perpendicular to a longitudinal movement. A road 250 mayinclude various number of lanes 210. A lane change may include a lateralmovement of a vehicle 100, 101.

A trajectory 230 may include a lane change caused by movement of thevehicle 100 having a lateral component. For example, the computer 110may be programmed to determine the trajectory 230 based on apredetermined vehicle 100 route that includes exiting a currentmulti-lane road 250 via an exit that is accessible through a lane 210 c.Thus, the computer 110 may be programmed to cause a plurality of lanechanges to move the vehicle 100 from the lane 210 a to the lane 210 c.Thus, a trajectory 230 may intersect one or more lane markings 220 andend in, e.g., a target lane 210 c. For example, as shown in FIG. 2A, thetrajectory 230 intersects two lane markings to move the vehicle 100 fromthe lane 210 a to the target lane 210 c.

With reference to FIGS. 2A-2B, a movement of the vehicle 100 on thetrajectory 230 may cause an impact to the second vehicle 101 b. FIG. 2Bshows that, when the vehicle 100 changes to the lane 210 b based on thetrajectory 230 and is positioned in a location where is illustrated by avirtual vehicle 100′, the vehicles 100, 101 b may impact one another.Thus, the host vehicle 100 computer 110 may be programmed to determinethat the second vehicle 101 b blocks the trajectory 230. The computer110 may be programmed to send a speed decrease instruction to the secondvehicle 101 b. The second vehicle 101 b computer 110 may be programmedto reduce the second vehicle 101 b speed based on the receivedinstruction. The decrease of speed of the second vehicle 101 b mayprevent that the second vehicle 101 b blocks the trajectory 230.

As another example, FIG. 2C shows that, when the vehicle 100 changesfrom the lane 210 a to the lane 210 b based on the trajectory 230, andis positioned in a location where is illustrated by vehicle 100′, thevehicles 100, 101 a may impact one another. For example, the vehicle 100may impact a rear end and/or a side of vehicle 101 a. The vehicle 100computer 110 may be programmed to send a speed increase instruction tothe second vehicle 101 a. The second vehicle 101 a computer 110 may beprogrammed to increase the second vehicle 101 a speed based on thereceived instruction.

The host vehicle 100 computer 110 may be programed to determine theinstruction based on a speed and/or location of the host vehicle 100, aspeed and/or location of second vehicles 101 such as vehicles 101 a, 101b, 101 c, proximate to the host vehicle 100, as discussed below.“Proximate” in the context of present disclosure refers to an areawithin a predetermined detection distance of the host vehicle 100. Thepredetermined detection distance may be constant, e.g., 100 meters, ormay depend on a maximum allowed speed of vehicles 100, 101 in a currentlocation of the host vehicle 100. For example, in a road 250 with aspeed limit of 130 km/hr the predetermined detection distance may be 100meters, whereas a predetermined distance in a road 250 with a speedlimit of 30 km/hr may be 25 meters.

In one example, the vehicle 100 computer 110 is programmed to determinethe speed and/or location of the second vehicles 101 proximate to thehost vehicle 100 based on data received from the vehicle 100 sensors 130such as a LIDAR sensor 130. Additionally or alternatively, the vehicle100 computer 110 may determine the speed and/or location of the secondvehicles 101 based on data received via the wireless communicationinterface 160, e.g., from second vehicles 101 sensors 130.

As shown in FIG. 2D, the vehicle 100 moving along the trajectory 230 mayenter the second lane 210 b in a location shown by vehicle 100′. Uponentry of the vehicle 100 to the lane 210 b, the vehicle 100 may havedistances d₄, d₅ from the second vehicles 101 a, 101 b. The vehicle 100computer 110 may be programmed to determine the instructions to increaseand/or reduce speed of the second vehicles 101 a, 101 b such that thedistances d₄, d₅ exceed a predetermined threshold, e.g., 25 meters. Forexample, the vehicle 100 computer 110 may determine the instructions toreduce the speed of the second vehicle 101 b such that the distance d₃exceeds the predetermined threshold.

Additionally or alternatively, the vehicle 100 computer 110 may increasethe vehicle 100 speed such that the distance d₃ when vehicle 100 entersthe lane 210 b exceeds the predetermined threshold. The vehicle 100computer 110 may determine the instruction based on the longitudinaldistances d₁, d₂ of vehicle 100 and the second vehicles 101 prior toentering the second lane 210 b, speed and location of the vehicles 100,101, the trajectory 230, etc.

Further additionally or alternatively, the computer 110 may determinethe instruction based on (a) projected change(s) of speed of one or moresecond vehicle 101. For example, if an increase of the second vehicle101 b is projected (e.g., planned by the second vehicle 101 computer110), a distance d₃ upon entrance of the vehicle 100 to the second lane210 b may be shorter compared to another scenario in which no increaseof the second vehicle 101 b is projected. In one example, the vehicle100 computer 110 may receive a projected speed of the second vehicle101, e.g., via the wireless communication interface 160. The vehicle 100computer 110 may be programmed to determine the threshold based on thespeed of the vehicle 100 and/or second vehicles 101, e.g., 50 meters for100 (kilometer per hour) km/h, 25 meters for 50 km/h, etc.

The computer 110 may be programmed to send an instruction to the secondvehicle 101 to modify the second vehicle 101 speed, e.g., to 20 km/hr.Additionally or alternatively, as shown in FIG. 3, the vehicle 100computer 110 may be programmed to send an instruction including a targetspeed pattern to the second vehicle 101 b to change the second vehicle101 b speed based on the pattern. For example, the computer 110 may sendan instruction to the second vehicle 101 b indicating that the secondvehicle 101 speed may start to reduce at time t₁ and reach a speed v₂ attime t₂. This may cause an increase in a space (distance) between thevehicles 101 a, 101 b that unblocks the trajectory 230. Additionally,the computer 110 may be programmed to send an instruction including atarget speed pattern to the second vehicle 101 b indicating that thesecond vehicle 101 b may resume the speed v₁ at time t₃.

Additionally, the computer 110 may be programmed to send one or morenotifications to other second vehicles 101 proximate to the host vehicle100 that are not instructed to modify their speed, indicating that oneor more second vehicles 101 speed is being modified based oninstructions transmitted by the host vehicle 100 computer 110. Forexample, the computer 110 may send notifications to the second vehicles101 a, 101 c indicating that the host vehicle 100 requested amodification of the second vehicle 101 b speed. In another example, thecomputer 110 may broadcast a message including a notification aboutmodifying a speed of a selected second vehicle 101 b.

In another example, the computer 110 may periodically send, e.g., every50 milliseconds (ms), an instruction including a target speed based onthe graph shown in FIG. 3. In yet another example, the computer 110 maysend a list of target speed values v₁, v₂, v₁ associated with times t₁,t₂, t₃, based on a target speed pattern. The second vehicle 101 computer110 may interpolate the target speed value for times between the timest₁, t₂, and t₃, based on the received list of target speeds v₁, v₂, v₁and times t₁, t₂, t₃. A time interval of t₁ to t₃ may be referred to asa control session, i.e., a time interval in which a speed of a secondvehicle 101 is controlled by a host vehicle 100 computer 110 rather thana second vehicle 101 computer 110. Thus, after t₃, the second vehicle101 may resume controlling of the second vehicle 101 speed. In oneexample, a control session may end based on a message from the hostvehicle 100 to the second vehicle 101 indicating an end of the controlsession.

The vehicle 100 computer 110 may be programmed to determine thetrajectory 230 based on a predetermined route, e.g., based on apredetermined destination. Additionally or alternatively, the computer110 may be programmed to determine a trajectory based on an activationof a vehicle 100 turn signal, e.g., via the HMI 140. For example, basedon activation of a left turn signal, the computer 110 may determine atrajectory 230. The computer 110 may be programmed to determine aplurality of possible trajectories 230, 230 a, 230 b, and then toidentify a trajectory, e.g., the trajectory 230 a, that is not blockedby a second vehicle 101. Specifically, the computer 110 may beprogrammed to determine a plurality of trajectories by changinglongitudinal and lateral components of vehicle 100 speed included in atrajectory.

The computer 110 may be further programmed to select one of the possibletrajectories based on various selection criteria. Initially, thecomputer 110 is typically programmed to ignore any trajectory 230 thatis blocked. Further, the computer 110 may be programmed to select atrajectory 230 based on which trajectory 230 may result in modifying aspeed of a least number of second vehicles 101 and/or which results in aleast aggregate speed modification to second vehicles 101, as describedbelow with reference to FIG. 4. The computer 110 then navigates thevehicle 100 in an autonomous, semi-autonomous, or non-autonomous modebased on the identified trajectory 230 a. In one example, moving thevehicle 100 on a trajectory 230 a may include a lateral movement whichmay lead to a need for reducing the second vehicle 101 b speed. In thisexample d₃ may be 5 meters, thus with a lateral movement of the vehicle100 to the lane 210 b, the second vehicle 101 b would be instructed toreduce its speed to ensure that the distance d₄ exceeds the distancethreshold, e.g., 25 meters (see FIG. 2D). The computer 110 could takethis speed modification in the second vehicle 101 in selecting thetrajectory 230 a for the host vehicle 100.

With reference to above described examples of trajectories 230, thecomputer 110 may be programmed to determine possible trajectories 230based on various inputs including current locations of vehicles 100,101, projection of vehicles 101 speed, lane 210 curvature, target lane210 and/or target location such as a highway exit ramp. Varioustechniques may be used for determining possible trajectories based onabove described inputs. As one example, the computer 110 may use adynamic state space model, such as is known, to determine possibletrajectories. A state-space model is a mathematical model of a physicalsystem, e.g., the vehicles 100, 101, and includes a set of inputs,outputs such as possible trajectories, and state variables. For example,state variables may be related by first-order differential equations.

The computer 110 may be programmed to determine possible trajectories byreceiving a state space model of the vehicles 100, 101, map dataincluding road 250 curvature, and the inputs described above.Additionally, the computer 110 may be programmed to determineinstructions that cause the vehicle 100 to move on each of thedetermined possible trajectories. For example, the computer 110 may beprogrammed to determine instructions to accelerate, brake, and/or steerthe vehicle 100 to stay on a respective trajectory.

The computer 110 may be programmed to determine possible trajectoriesbased on specific limitations and/or optimization criteria. For example,the computer 110 may be programmed based on a model that implements thelimitations and/or optimization criteria. Possible limitations mayinclude a maximum time and/or maximum distance threshold to finish alane change. The limitations may include a maximum or minimum allowedspeed in the current location. The limitations may include vehicle 100,101 physical attributes such as maximum available longitudinal and/orlateral acceleration, e.g., based on vehicle 100 engine power. Thelimitations may include maximum available deceleration, e.g., based onbrake system attributes. The limitations may include environmentalconditions, e.g., a reduced road 250 surface friction coefficient due toinclement weather, and/or loading conditions of a vehicle 100, 101.Possible optimization criteria may include minimizing specificparameters caused by the host vehicle 100 instructions. For example, theoptimization criteria may include minimizing acceleration and/ordeceleration of second vehicles 101 based on the host vehicle 100instructions. In another example, for improved fuel economy, theoptimization criteria may include minimizing longitudinal acceleration.In yet another example, for improved comfort, the optimization criteriamay include minimizing a lateral acceleration, deceleration, and/or rollof the vehicles 100, 101.

As another example, the computer 110 may be programmed to send aplurality of instructions to a plurality of second vehicles 101. Each ofthe instructions may be associated with one of the second vehicles 101and may be based on a speed and a location of the respective secondvehicle 101. For example, the computer 110 may send instructions to thesecond vehicles 101 b, 101 c to decrease speed to unblock the trajectory230. The computer 110 may send a speed decrease instruction to thesecond vehicle 101 b and a speed increase instruction to the secondvehicle 101 a to ensure that both distances d₄ and d₅ exceed thepredetermined distance threshold.

Upon receiving an instruction from the host vehicle 100, a secondvehicle 101 may accept to apply the received instruction and send anacknowledgement reply, or may refuse to modify its speed based on thereceived instruction and send a refusal reply to the host vehicle 100.The host vehicle 100 computer 110 may determine that the second vehicle101 b refuses to modify its speed based on the reply received from thesecond vehicle 101 or based on data received from the vehicle 100sensors 130, e.g., determining a lack of an expected change in thesecond vehicle 101 speed. Upon receiving a refusal from the secondvehicle to modify its speed, the vehicle 100 computer 110 may beprogrammed to determine a second trajectory 230 a, 230 b of the hostvehicle 100. The computer 110 may be further programmed to identify asecond vehicle 101 a that blocks the second trajectory 230 b, and send asecond instruction to adjust the second vehicle 101 a speed based on thesecond trajectory 230 b, a second vehicle 101 a location, and a secondvehicle 101 a speed.

The second vehicle 101 computer 110 may be programmed to apply thereceived instruction upon determining that the received instruction isacceptable. The second vehicle 101 computer 110 may be programmed todetermine whether the received instruction is acceptable by determiningwhether executing the received instruction is predicted to cause animpact with another vehicle 101 and/or an obstacle, and/or is predictedto cause the second vehicle 101 to depart from an expected path. Forexample, the second vehicle 101 computer 110 may determine whether thereceived instruction is acceptable by determining that the target speedis within an expected speed range, e.g., maximum allowed speed in thecurrent location of the second vehicle 101. Additionally oralternatively, the expected speed range may further be based on currentweather conditions. For example, the expected speed range may belimited, e.g., 80 km/hr, to less than a normally maximum allowed speedlimit, e.g., 100 km/h, due to inclement weather conditions.

As another example, the second vehicle 101 computer 110 may determinewhether the received instruction is acceptable based on a maximumexpected acceleration threshold. For example, the computer 110 may beprogrammed to refuse an instruction with a target speed that causes anacceleration of more than 5 meter per second squared (m/s²). Forexample, with reference to FIG. 3, the second vehicle 101 computer 110may refuse an instruction with a target speed of 30 km/hr, when thedifference between t₁ and t₂ is 2 seconds and a current speed of thesecond vehicle 101 is 70 km/hr.

The vehicle 100 computer 110 may be programmed to send the instructionincluding an identifier, e.g., license plate number, of the secondvehicle 101 and a second vehicle 101 target speed value. The secondvehicle 101 computer 110 may be programmed to determine that thereceived instruction is associated with the second vehicle 101 based onthe identifier included in the received instructions. The second vehicle101 computer 110 may be programmed to apply the received instruction byactuating second vehicle 101 operations based on the receivedinstruction.

In one example, the second vehicle 101 computer 110 may periodicallyreceive instructions, e.g., every 50 ms, from the host vehicle 100 tomodify the second vehicle 101 speed. In other words, the host vehicle100 computer 110 may be programmed to periodically send an instructionto the second vehicle 101 b, e.g., from a time that a lane change to thelane 210 b starts until the host vehicle 100 is located in the secondlane 210 b and a distance d₄ between the vehicles 100, 101 b exceeds thepredetermined threshold.

Processing

FIGS. 4A-4C show an example process 400 for a host vehicle 100 sendinginstructions to second vehicle(s) 101 for unblocking a trajectory 230 ofthe host vehicle 100. In one example, the vehicle 100 computer 110 maybe programmed to execute blocks of the process 400.

The process 400 begins in a block 405, in which the computer 110determines whether the vehicle 100 operates in a manual (ornon-autonomous) mode. In one example, the vehicle 100 may be operated ina non-autonomous, autonomous, or semi-autonomous mode. If the computer110 determines that the vehicle 100 operates in a non-autonomous mode,then the process 400 proceeds to a decision block 410; otherwise theprocess 400 proceeds to a block 415.

In the decision block 410, the computer 110 determines whether a turnsignal is detected. For example, the computer 110 may detect a right orleft turn signal following user input to a turn signal lever or the likeincluded in an HMI 140. A right or left turn signal while a vehicle istraveling on a highway typically indicates an intention of a user of anon-autonomously operating vehicle 100 to change to a right or left lane210. Additionally or alternatively, the computer 110 may be programmedto receive some other input from a vehicle 100 user to the HMI 140indicating an intention to change a lane 210, e.g., via audio input,gesture detection, etc. Additionally or alternatively, the computer 110may be programmed to receive input including a request for a pluralityof lane changes, e.g., an audio command such as “change two lanes to theleft.” If the computer 110 determines that the turn signal is received,then the process 400 proceeds to a block 430; otherwise the process 400returns to the decision block 410.

In the block 415, the computer 110 receives route data such as a currentlocation of the vehicle 100, a destination, traffic data, etc.

Next, in a block 420, the computer 110 identifies a route for thevehicle 100 to the received destination. For example, the computer 110may identify the route based on the current vehicle 100 location, thereceived destination, traffic data, etc., using known route planningtechniques. The computer 110 may be further programmed to actuatevehicle 100 actuators 120 to operate the vehicle 100, e.g., byaccelerating on a road 250, based on the identified route.

Next, in a decision block 425, the computer 110 determines whether alane change is warranted. For example, the computer 110 may determinethat a lane change is warranted based on a current location of thevehicle and the identified route. The vehicle 100 may receive thecurrent location of the vehicle 100 from the vehicle 100 GPS sensor 130.Additionally, the computer 110 may be programmed to determine whether alane change is warranted based on location coordinates of the vehicle100 and data received from one or more vehicle 100 camera sensors 130.Additionally or alternatively, the computer 110 may be programmed todetermine that a lane change is warranted upon determining that atime-to-collision with an obstacle on the current lane 210 of the hostvehicle 100 is less than a time-to-stop the vehicle 100 by braking. Inother words, the computer 110 may be programmed to determine that a lanechange is needed to prevent a collision of the host vehicle 100 with anobstacle on the host vehicle 100 current lane 210. If the computer 110determine that the lane change is warranted, then the process 400proceeds to a block 430; otherwise the process 400 returns to thedecision block 425.

In the block 430, the computer 110 determines one or more trajectories230 based on a location and/or speed of the vehicle 100, a locationand/or speed of other vehicles 101 proximate to the vehicle 100, targetlane 210, etc. For example, as shown in FIG. 2A, the computer 110 maydetermine a plurality of trajectories 230, 230 a, 230 b by determiningvarious longitudinal and lateral movements for the vehicle 110 to travelinto the target lane 210. In one example, as described above a pluralityof possible trajectories may be determined between a current vehicle 100location on the current lane 210 a and a target location on a targetlane 210 c, e.g., depending on how the longitudinal and lateralcomponents of the vehicle 100 speed change while the vehicle 100 movesfrom the current lane 210 a to the target lane 210 c.

Continuing with the process 400 as illustrated in FIG. 4B, next, in adecision block 435, the computer 110 determines if at least one of thepossible determined trajectories is not blocked. The computer 110 maydetermine that a trajectory is blocked upon determining that, without amodification of a second vehicle 101 speed, the vehicles 100, 101 mayimpact one another, i.e., collide (see FIG. 2B). In one example, shownin FIG. 2A, the computer 110 may determine based on the second vehicle101 speed, the vehicle 100 speed, and/or the trajectory 230, that thevehicle 100 may move on the trajectory 230 without any modification ofthe second vehicle 101 speed. Thus, the computer 110 may determine thatthe trajectory 230 is not blocked. However, in one example, shown inFIG. 2B, the computer 110 may determine that the trajectory 230 a isblocked because without a modification of the second vehicle 101 b speedthe vehicles 100, 101 b may collide. Thus, to move the vehicle 100 on ablocked trajectory, a speed of at least one second vehicle 101 should bemodified. If the computer 110 determines that at least one of thepossible trajectories is not blocked, then the process 400 proceeds to ablock 470 (see FIG. 4C); otherwise the process 400 proceeds to adecision block 440.

Next, in the block 440, the computer 110 selects a trajectory 230 tofollow. The computer 110 may be programmed to select a trajectory basedon various criteria. In one example, the computer 110 may be programmedto select a trajectory that leads to a least number of second vehicles101 instructed to modify their speed. Alternatively, or in combinationwith the foregoing, the computer 110 may be programmed to select atrajectory that leads to least aggregate amount of speed modification ofsecond vehicles 101. For example, if a trajectory 230 a needs twovehicles 101 to receive instructions from the host vehicle 100 to adjusttheir speed, and a trajectory 230 b needs only one vehicle 101 toreceive instructions from the host vehicle 100, then the computer 110may be programmed to select the trajectory 230 b. Additionally oralternatively, the computer 110 may be programmed to select a trajectory230 that minimizes a modification of speed to be requested of one ormore second vehicles 101. For example, an amount of speed modificationmay be based on the distance d₃. If the vehicle 100 makes a lateralmovement to the lane 210 b while d₃ is 5 meters and a distance thresholdis 25 meters, then the second vehicle 101 b may be instructed to make alarger speed reduction compared to when the distance d₃ is 20 meters. Inother words, to achieve a distance d₅ that exceeds the distancethreshold, the second vehicle 101 b speed, when the distance d₃ is 5meters, may be reduced more than when the distance d₃ is 20 meters.Continuing this example, if a trajectory 230 a may cause 20 km/hr speedreduction of a second vehicle 101 and a trajectory 230 b causes 30 km/hrspeed reduction for a second vehicle 101, then the computer 110 may beprogrammed to select the trajectory 230 a.

Additionally or alternatively, the computer 110 may be programmed toselect a trajectory from the possible trajectories based on anoptimization function. For example, a function such as W=aN+bV may beused to represent a weight of a trajectory. W, N, and V in this examplerespectively represent a weight of a trajectory, a number of secondvehicles 101 affected by the respective trajectory 230 (i.e. their speedwould be modified), and an aggregate amount of speed modification insecond vehicle(s) 101 which is caused by the respective trajectory 230.Parameters a and b may determine a relationship of an input value, i.e.,N and V, on the output value W. In one example, the computer 110 may beprogrammed to select one of the possible trajectories that is associatedwith a lowest W compared to other possible trajectories. In one example,when the block 440 is reached via a decision block 460, then thecomputer 110 may be programmed to select a trajectory 230 that has notbeen selected before.

As discussed with reference to blocks 445, 450, 455, and 460, thecomputer 110 may be programmed to evaluate one by one each of, e.g., thetrajectories 230, 230 a, 230 b, to determine which of the trajectories230, 230 a, 230 b can be unblocked based on a refusal or acceptancereply of the second vehicles 101. The computer 110 may be programmed, asdiscussed above, to select a preferred trajectory, e.g., the trajectorywith lowest W, and if the second vehicles 101 associated with thattrajectory (i.e., the second vehicles 101 which are instructed to modifytheir speed) refuses to follow the instruction, the computer 110 may beprogrammed to select other determined trajectories 230, 230 a, 230 b.

Next, in a block 445, the computer 110 identifies one or more secondvehicles 101 to receive instructions based on the selected trajectory230. For example, based on selecting the trajectory 230 a, the computer110 may be programmed to identify the second vehicle 101 b to receive aninstruction to reduce the second vehicle 101 b speed.

Next, in a block 450, the computer 110 sends one or more instructions tothe selected second vehicle(s) 101. For example, with reference to FIGS.2A-2B, the computer 110 may be programed to send an instruction to thesecond vehicle 101 b to reduce the second vehicle 101 b speed. Theinstruction may include a target speed, e.g., 35 km/hr, and anidentifier such as vehicle identification number (VIN), license platenumber, etc., of the selected second vehicle 101 b. Additionally oralternatively, the computer 110 may be programmed to send a target speedpattern such as a pattern shown in FIG. 3 to the selected second vehicle101 b.

Yet further additionally or alternatively, the computer 110 may beprogrammed to send a time-to-collision between the host vehicle 100 andan obstacle in the current lane 210 of the host vehicle 100. In otherwords, the computer 110 may inform the second vehicle 101 about anurgency of the requested speed modification. For example, the secondvehicle 101 may be programmed to change one or more thresholdsassociated with determining whether to accept an instruction from thevehicle 100. The second vehicle 100 computer 110 may be programmed torefuse a modification of the second vehicle 100 speed when the modifiedspeed exceeds a maximum allowed speed limit and no urgency is indicatedby the vehicle 100. However, the second vehicle 101 computer 110 may beprogrammed to accept a modification of the second vehicle 101 speed evenwhen the target speed exceeds the maximum allowed speed limit if thereceived instruction includes a binary flag, set to “yes,” or “1” or thelike, indicating an urgency of the vehicle 100 to change from the lane210 a to the lane 210 b. In one example, the instruction may include atime-to-collision and a time-to-stop of the vehicle 100.

Next, in a decision block 455, the computer 110 determines whether theselected second vehicle(s) 101 accepted the sent instruction(s), e.g.,based on acceptance or refusal messages received via V-to-Vcommunications. In one example, the computer 110 may be programmed todetermine that the instruction(s) is(are) accepted upon determining thateach of selected second vehicles 101 accepted the instructions. In otherwords, if at least one of the selected second vehicles 101 refuses toaccept the received instruction, then, for purposes of the block 455,the vehicle 100 computer 110 may be programmed to determine that all ofthe second vehicles 101 refused the instructions, i.e., thedetermination of the block 455 is negative. For example, with referenceto the FIG. 2A, if the second vehicle 101 c accepts, whereas the secondvehicle 101 b refuses to accept, then the vehicle 100 computer 110 maydetermine that, collectively, the second vehicles 101 associated withthe selected trajectory 230 refused the received instructions, e.g.,because the vehicle 100 may not move on the trajectory 230 due to apossibility of impact with the refusing second vehicle 101 b. If thevehicle 100 computer 110 determines that the second vehicles 101accepted the received instructions, then the process 400 proceeds to adecision block 470 (see FIG. 4C); otherwise the process 400 proceeds toa decision block 460.

In the decision block 460, the computer 110 determines whether any othertrajectory 230 is available. In one example, the computer 110 may beprogrammed to determine that another trajectory is available upondetermining that at least one of the trajectories has not previouslybeen provided to one or more second vehicles 101 for acceptance orrefusal. For example, the computer 110 may be programmed to determinethat no other trajectory 230 is available upon determining that all ofdetermined trajectories 230 have been already refused (see the decisionblock 455). If the computer 110 determines that another trajectory 230is available, then the process 400 proceeds to the block 440; otherwisethe process 400 proceeds to a block 465.

In the block 465, the computer 110 modifies the vehicle 100 route basedon the inability to select a trajectory for a lane change. In anon-autonomous and/or semi-autonomous mode, the computer 110 may beprogrammed to identify an alternative route to the received destinationand operate the vehicle 100 based on the identified alternative route.In another example, when the vehicle 100 is operated in semi-autonomousand/or autonomous mode, a reduction of the vehicle 100 speed may lead todetermining new possible trajectories, e.g., because the second vehicles101 which block the trajectories may pass by. Thus, in one example, thecomputer 110 may be programmed to decelerate and return to the block430, although not shown in FIG. 4B. In another example, in anon-autonomous mode, the computer 110 may be programmed to output amessage via the vehicle 100 HMI 140 indicating that the target lane isblocked. The vehicle 100 user may then identify a different route.Following the block 465, the process 400 ends; or alternatively returnsto the block 405, although not shown in FIG. 4B.

Turning to FIG. 4C, in the decision block 470, the computer 110determines whether the vehicle 100 is operating in the autonomous mode.If the computer 110 determines that the vehicle 100 operates in theautonomous mode, then the process 400 proceeds to a block 475; otherwisethe process 400 proceeds to a decision block 480.

In the block 475, the computer 110 performs the lane change based on theselected trajectory 230, e.g., by actuating the vehicle 100 actuators120, e.g., steering. In one example, the computer 110 may be furtherprogrammed to perform the lane change upon determining that the selectedsecond vehicle(s) 101 performed the instructions, e.g., based on changeof the second vehicle(s) 101 speed.

In the decision block 480, the computer 110 determines whether thevehicle 100 is operating in a semi-autonomous mode. If the computer 110determines that the vehicle 100 is operated in a semi-autonomous mode,then the process 400 proceeds to a decision block 485; otherwise theprocess 400 proceeds to a block 490.

In the decision block 485, the computer 110 determines whether a vehicle100 user accepted the lane change based on the selected trajectory 230.In one example, the computer 110 is programmed to output informationincluding a proposed lane change based on the selected trajectory 230,e.g., via a graphical display showing an arrow in a direction of theselected trajectory 230, via the vehicle 100 HMI 140. The computer 110may be programmed to receive an entry, e.g., via the vehicle 100 HMI140, including a decision of the user to accept or refuse the proposedlane change. If the computer 110 determines that the vehicle 100 useraccepted the proposed lane change, then the process 400 proceeds to theblock 475; otherwise the process 400 returns to the decision block 485.

In the block 490, the vehicle 100 having been determined to be in themanual mode, the computer 110 prompts the vehicle 100 user to change thelane. For example, the computer 110 may actuate the vehicle 100 HMI 140to output information, e.g., a blinking green lamp, to indicate that theuser may change the lane 210 in the proposed direction such as thedirection of received turn signal. The block 490 may be reached when thevehicle 100 is operated in the non-autonomous mode. Thus, the vehicle100 user may actuate a vehicle 100 actuator 120 to change the lane 210.

Next, in a decision block 495, the computer 110 determines whether thelane change is completed, or the selected trajectory 230 has beentravelled by the vehicle 100, e.g., the vehicle 100 has reached the lane210 c, with reference to the trajectory 230 shown in FIG. 2A. Thecomputer 110 may be programmed to determine whether the lane change iscompleted based on data received from the vehicle 100 sensors 130, e.g.,the GPS sensor 130, the camera sensor 130, etc. If the computer 110determines that the lane change is completed and/or the selectedtrajectory 230 is travelled, then the process 400 proceeds to a block496; otherwise the process 400 returns to the decision block 495.

In the block 496, the computer 110 transmits a message confirming an endof the control session. For example, the computer 110 may be programmedto transmit a message via the wireless communication interface 160including an identifier of the selected second vehicle(s) 101 andinformation confirming that the vehicle 100 ends a modification of speedof the selected second vehicles 101.

Following the block 496, the process 400 ends; or, returns to the block405, although not shown in FIG. 4C.

FIG. 5 shows an example process 500 for a second vehicle 101 receivinginstructions from a host vehicle 100. For example, a second vehicle 101computer 110 may be programmed to execute blocks of the process 500.

The process 500 begins in a decision block 505, in which the secondvehicle 101 computer 110 determines whether an instruction is receivedfrom a host vehicle 100, e.g., via a second vehicle 101 wirelesscommunication interface 160. If the second vehicle 101 computer 110determines that the instruction is received from the host vehicle 100,then the process 500 proceeds to a decision block 510; otherwise theprocess 500 returns to the decision block 505.

In the decision block 510, the second vehicle 101 computer 110determines whether the received instruction is acceptable. For example,the second vehicle 101 computer 110 may be programmed to determinewhether the received instruction is acceptable based on the targetspeed, a predetermined target speed threshold, a predeterminedacceleration threshold, a time-to-collision of the host vehicle on thecurrent lane 210 of the host vehicle 00, etc. If the computer 110determines that the received instruction is acceptable, then the process500 proceeds to a block 515; otherwise the process 500 proceeds to ablock 520.

In the block 515, the computer 110 sends an acceptance message to thehost vehicle 100, e.g., via the second vehicle 101 wirelesscommunication interface 160.

In the block 520, the second vehicle 101 computer 110 transmits arefusal message to the host vehicle 100, e.g., via the second vehicle101 wireless communication interface 160. Following the block 520, theprocess 500 ends; or, alternatively returns to the decision block 505(although not shown in FIG. 5).

Following the block 515, in a block 525, the second vehicle 101 computer110 applies the received instruction, e.g., by actuating the secondvehicle 101 actuators 120. For example, the second vehicle 101 computer110 actuates the second vehicle 101 propulsion and/or braking actuators120 to modify the second vehicle 101 speed to the received target speedand/or target speed pattern.

Next, in a decision block 530, the second vehicle 101 computer 110determines whether the control session is finished, i.e., whether thehost vehicle 100 intends to further modify the second vehicle 101 speed.For example, the second vehicle 101 computer 110 may be programmed todetermine that the control session is finished upon receiving a message,e.g., via V-to-V communications, from the host vehicle 100 confirmingthat the control session is finished. If the computer 110 determinesthat control session is finished, then the process 500 proceeds to ablock 535; otherwise the process 500 returns to the decision block 530;or, alternatively returns to the decision block 505, although not shownin FIG. 5.

In the block 535, the computer 110 resumes operation of the secondvehicle 101 based on, e.g., a second vehicle 101 planned speed. Forexample, the computer 110 of the second vehicle 101 may be programmed tomodify the speed of the second vehicle 101 to reach a speed planned bythe second vehicle 101 computer 110 different from the target speedinstructed by the host vehicle 100.

Following the block 535, the process 500 ends.

The article “a” modifying a noun should be understood as meaning one ormore unless stated otherwise, or context requires otherwise. The phrase“based on” encompasses being partly or entirely based on.

Computing devices as discussed herein generally each includeinstructions executable by one or more computing devices such as thoseidentified above, and for carrying out blocks or steps of processesdescribed above. Computer-executable instructions may be compiled orinterpreted from computer programs created using a variety ofprogramming languages and/or technologies, including, withoutlimitation, and either alone or in combination, Java™, C, C++, VisualBasic, Java Script, Perl, HTML, etc. In general, a processor (e.g., amicroprocessor) receives instructions, e.g., from a memory, acomputer-readable medium, etc., and executes these instructions, therebyperforming one or more processes, including one or more of the processesdescribed herein. Such instructions and other data may be stored andtransmitted using a variety of computer-readable media. A file in thecomputing device is generally a collection of data stored on a computerreadable medium, such as a storage medium, a random access memory, etc.

A computer-readable medium includes any medium that participates inproviding data (e.g., instructions), which may be read by a computer.Such a medium may take many forms, including, but not limited to,non-volatile media, volatile media, etc. Non-volatile media include, forexample, optical or magnetic disks and other persistent memory. Volatilemedia include dynamic random access memory (DRAM), which typicallyconstitutes a main memory. Common forms of computer-readable mediainclude, for example, a floppy disk, a flexible disk, hard disk,magnetic tape, any other magnetic medium, a CD-ROM, DVD, any otheroptical medium, punch cards, paper tape, any other physical medium withpatterns of holes, a RAM, a PROM, an EPROM, a FLASH, an EEPROM, anyother memory chip or cartridge, or any other medium from which acomputer can read.

With regard to the media, processes, systems, methods, etc. describedherein, it should be understood that, although the steps of suchprocesses, etc. have been described as occurring according to a certainordered sequence, such processes could be practiced with the describedsteps performed in an order other than the order described herein. Itfurther should be understood that certain steps could be performedsimultaneously, that other steps could be added, or that certain stepsdescribed herein could be omitted. In other words, the descriptions ofsystems and/or processes herein are provided for the purpose ofillustrating certain embodiments, and should in no way be construed soas to limit the disclosed subject matter.

Accordingly, it is to be understood that the present disclosure,including the above description and the accompanying figures and belowclaims, is intended to be illustrative and not restrictive. Manyembodiments and applications other than the examples provided would beapparent to those of skill in the art upon reading the abovedescription. The scope of the invention should be determined, not withreference to the above description, but should instead be determinedwith reference to claims appended hereto and/or included in anon-provisional patent application based hereon, along with the fullscope of equivalents to which such claims are entitled. It isanticipated and intended that future developments will occur in the artsdiscussed herein, and that the disclosed systems and methods will beincorporated into such future embodiments. In sum, it should beunderstood that the disclosed subject matter is capable of modificationand variation.

1. A computer, programmed to: determine a trajectory of a first vehicle;and upon determining that a second vehicle blocks the determinedtrajectory, send, to the second vehicle, an instruction, based on thedetermined trajectory of the first vehicle, a second vehicle location,and a second vehicle speed, to adjust the second vehicle speed.
 2. Thecomputer of claim 1, wherein the instruction is further based on a firstvehicle speed and a first vehicle location.
 3. The computer of claim 1,further programmed to determine the second vehicle speed and the secondvehicle location based on data received from first vehicle sensors. 4.The computer of claim 1, wherein the determined trajectory of the firstvehicle includes a lateral lane change.
 5. The computer of claim 1,wherein the determined trajectory of the first vehicle includes acurvature intersecting at least one road lane marking.
 6. The computerof claim 1, further programmed to determine the trajectory based on apredetermined route.
 7. The computer of claim 1, further programmed todetermine the trajectory based on activation of a first vehicle turnsignal.
 8. The computer of claim 1, further programmed to: uponreceiving a refusal from the second vehicle to modify its speed,determine a second trajectory of the first vehicle; identify a thirdvehicle that blocks the second trajectory; and send, to the thirdvehicle, a second instruction to adjust a third vehicle speed based onthe second trajectory, a second vehicle location, and a second vehiclespeed.
 9. The computer of claim 1, further programmed to send aplurality of instructions to a plurality of second vehicles, whereineach of the instructions is associated with one of the plurality ofsecond vehicles and is based at least on a speed and a location of therespective second vehicle. 10-20. (canceled)
 21. A method, comprising:determining a trajectory of a first vehicle; and upon determining that asecond vehicle blocks the determined trajectory, sending, to the secondvehicle, an instruction, based on the determined trajectory of the firstvehicle, a second vehicle location, and a second vehicle speed, toadjust the second vehicle speed.
 22. The method of claim 21, wherein theinstruction is further based on a first vehicle speed and a firstvehicle location.
 23. The method of claim 21, further comprisingdetermining the second vehicle speed and the second vehicle locationbased on data received from first vehicle sensors.
 24. The method ofclaim 21, wherein the determined trajectory of the first vehicleincludes a lateral lane change.
 25. The method of claim 21, wherein thedetermined trajectory of the first vehicle includes a curvatureintersecting at least one road lane marking.
 26. The method of claim 21,further comprising determining the trajectory based on a predeterminedroute.
 27. The method of claim 21, further comprising determining thetrajectory based on activation of a first vehicle turn signal.
 28. Themethod of claim 21, further comprising: upon receiving a refusal fromthe second vehicle to modify its speed, determining a second trajectoryof the first vehicle; identifying a third vehicle that blocks the secondtrajectory; and sending, to the third vehicle, a second instruction toadjust a third vehicle speed based on the second trajectory, a secondvehicle location, and a second vehicle speed.
 29. The method of claim21, further comprising sending a plurality of instructions to aplurality of second vehicles, wherein each of the instructions isassociated with one of the plurality of second vehicles and is based atleast on a speed and a location of the respective second vehicle. 30.The method of claim 21, further comprising: determining, in the secondvehicle, whether to accept the received instruction based on at least onone of a second vehicle target speed and a time-to-collision of thefirst vehicle; applying the received instruction by actuating secondvehicle operations, upon determining that the received instruction isacceptable, actuating a second vehicle actuator based on the receivedinstruction